Width Parameters Beyond Tree-width and their Applications
نویسندگان
چکیده
PETR HLINĚNÝ1,2,*, SANG-IL OUM3,7, DETLEF SEESE4 AND GEORG GOTTLOB5,6 Faculty of Informatics, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic VŠB, Technical University of Ostrava, Ostrava, Czech Republic School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA Institute AIFB, University Karlsruhe (TH), D-76128 Karlsruhe, Germany Oxford University Computing Laboratory, Parks Road, Oxford OX1 3QD, UK Vienna University of Technology, Vienna, Austria Present address: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada *Corresponding author: [email protected]
منابع مشابه
Tangle-tree duality: in graphs, matroids and beyond⇤
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets. Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversel...
متن کاملDigraph width measures in parameterized algorithmics
In contrast to undirected width measures such as tree-width, which have provided many important algorithmic applications, analogous measures for digraphs such as directed tree-width or DAG-width do not seem so successful. Several recent papers have given some evidence on the negative side. We confirm and consolidate this overall picture by thoroughly and exhaustively studying the complexity of ...
متن کاملThread Graphs, Linear Rank-Width and Their Algorithmic Applications
Many NP-hard graph problems can be efficiently solved on graphs of bounded tree-width. Several articles have recently shown that the so-called rank-width parameter also allows efficient solution of most of these NP-hard problems, while being less restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard on graphs of bounded rank-width...
متن کاملA comparison of two approaches for polynomial time algorithms computing basic graph parameters
In this paper we compare and illustrate the algorithmic use of graphs of bounded treewidth and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graphs of bounded clique-widt...
متن کاملFly-Automata, Their Properties and Applications
We address the concrete problem of implementing huge bottom-up term automata. Such automata arise from the verification of Monadic Second Order propositions on graphs of bounded tree-width or clique-width. This applies to graphs of bounded tree-width because bounded tree-width implies bounded clique-width. An automaton which has so many transitions that they cannot be stored in a transition tab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 51 شماره
صفحات -
تاریخ انتشار 2008